On Globally Optimal Local Modeling: From Moving Least Squares to Over-parametrization
نویسندگان
چکیده
This paper discusses a variational methodology, which involves locally modeling of data from noisy samples, combined with global model parameter regularization. We show that this methodology encompasses many previously proposed algorithms, from the celebrated moving least squares methods to the globally optimal over-parametrization methods recently published for smoothing and optic flow estimation. However, the unified look at the range of problems and methods previously considered also suggests a wealth of novel global functionals and local modeling possibilities. Specifically, we show that a new non-local variational functional provided by this methodology greatly improves robustness and accuracy in local model recovery compared to previous methods. The proposed methodology may be viewed as a basis for a general framework for addressing a variety of common problem domains in signal and image processing and analysis, such as denoising, adaptive smoothing, reconstruction and segmentation.
منابع مشابه
Optimal Pareto Parametric Analysis of Two Dimensional Steady-State Heat Conduction Problems by MLPG Method
Numerical solutions obtained by the Meshless Local Petrov-Galerkin (MLPG) method are presented for two dimensional steady-state heat conduction problems. The MLPG method is a truly meshless approach, and neither the nodal connectivity nor the background mesh is required for solving the initial-boundary-value problem. The penalty method is adopted to efficiently enforce the essential boundary co...
متن کاملA New Technique for Image Zooming Based on the Moving Least Squares
In this paper, a new method for gray-scale image and color zooming algorithm based on their local information is offered. In the proposed method, the unknown values of the new pixels on the image are computed by Moving Least Square (MLS) approximation based on both the quadratic spline and Gaussian-type weight functions. The numerical results showed that this method is more preferable to biline...
متن کاملToward Approximate Moving Least Squares Approximation with Irregularly Spaced Centers
By combining the well known moving least squares approximation method and the theory of approximate approximations due to Maz’ya and Schmidt we are able to present an approximate moving least squares method which inherits the simplicity of Shepard’s method along with the accuracy of higher-order moving least squares approximations. In this paper we focus our interest on practical implementation...
متن کاملOPTIMAL SHAPE DESIGN OF GRAVITY DAMS BASED ON A HYBRID META-HERURISTIC METHOD AND WEIGHTED LEAST SQUARES SUPPORT VECTOR MACHINE
A hybrid meta-heuristic optimization method is introduced to efficiently find the optimal shape of concrete gravity dams including dam-water-foundation rock interaction subjected to earthquake loading. The hybrid meta-heuristic optimization method is based on a hybrid of gravitational search algorithm (GSA) and particle swarm optimization (PSO), which is called GSA-PSO. The operation of GSA-PSO...
متن کاملOptimization of Meshless Local Petrov-Galerkin Parameters using Genetic Algorithm for 3D Elasto-static Problems (TECHNICAL NOTE)
A truly Meshless Local Petrov-Galerkin (MLPG) method is developed for solving 3D elasto-static problems. Using the general MLPG concept, this method is derived through the local weak forms of the equilibrium equations, by using a test function, namely, the Heaviside step function. The Moving Least Squares (MLS) are chosen to construct the shape functions. The penalty approach is used to impose ...
متن کامل